Fast Randomized Algorithms for Partitioning , Sparsification , and Solving Linear Systems
نویسنده
چکیده
4 Combinatorial Preconditioners 6 4.1 Graphic Inequalities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.2 Graphic Inequalities with Trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 4.3 Augmented Tree Preconditioners . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 4.4 Sparsifying . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 4.5 Proving sparsifiers exist . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 4.6 History of Combinatorial Preconditioning . . . . . . . . . . . . . . . . . . . . . . . . 13
منابع مشابه
Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
We present a randomized algorithm that, on input a weakly diagonally dominant symmetric n-by-n matrix A with m non-zero entries and an n-vector b, produces an x̃ such that ‖x − x̃‖ A ≤ ǫ ‖x‖ A , where Ax = b, in expected time m log n log(1/ǫ). The algorithm applies subgraph preconditioners in a recursive fashion. These preconditioners improve upon the subgraph preconditioners first introduced by ...
متن کاملSpectral Sparsification of Graphs
We introduce a new notion of graph sparsification based on spectral similarity of graph Laplacians: spectral sparsification requires that the Laplacian quadratic form of the sparsifier approximate that of the original. This is equivalent to saying that the Laplacian of the sparsifier is a good preconditioner for the Laplacian of the original. We prove that every graph has a spectral sparsifier ...
متن کاملar X iv : 0 80 8 . 41 34 v 2 [ cs . D S ] 1 9 Se p 20 08 Spectral Sparsification of Graphs ∗
We introduce a new notion of graph sparsificaiton based on spectral similarity of graph Laplacians: spectral sparsification requires that the Laplacian quadratic form of the sparsifier approximate that of the original. This is equivalent to saying that the Laplacian of the sparsifier is a good preconditioner for the Laplacian of the original. We prove that every graph has a spectral sparsifier ...
متن کاملCockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach
Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for ...
متن کاملO ct 2 00 3 Nearly - Linear Time Algorithms for Graph Partitioning , Graph Sparsification , and Solving Linear Systems preliminary draft
We develop nearly-linear time algorithms for approximately solving sparse symmetric diagonally-dominant linear systems. In particular, for every β > 0 we present a linearsystem solver that, given an n-by-n symmetric diagonally-dominant matrix A with m nonzero entries and an n-vector b, produces a vector x̃ within relative distance ǫ of the solution to Ax = b in time O(m log(1/ǫ) log(nκf (A)) ), ...
متن کامل